CIRCLE STRUCTURE DERIVED FROM DECOMPOSITION OF ASYMMETRIC DATA MATRIX
نویسندگان
چکیده
منابع مشابه
Matrix Decomposition Techniques for Data Privacy
Data mining technologies have now been used in commercial, industrial, and governmental businesses, for various purposes, ranging from increasing profitability to enhancing national security. The widespread applications of data mining technologies have raised concerns about trade secrecy of corporations and privacy of innocent people contained in the datasets collected and used for the data min...
متن کاملDecomposition of Rings under the Circle Operation
We consider rings S, not necessarily with 1, and develop a decomposition theory for submonoids and subgroups of (S, ◦) where the circle operation ◦ is defined by x ◦ y = x + y − xy. Decompositions are expressed in terms of internal semidirect, reverse semidirect and general products, which may be realised externally in terms of naturally occurring representations and antirepresentations. The th...
متن کاملFrom Tensor to Coupled Matrix/Tensor Decomposition
Decompositions of higher-order tensors are becoming more and more important in signal processing, data analysis, machine learning, scientific computing, optimization and many other fields. A new trend is the study of coupled matrix/tensor decompositions (i.e., decompositions of multiple matrices and/or tensors that are linked in one or several ways). Applications can be found in various fields ...
متن کاملPlanar decomposition for quadtree data structure
The quadtree data structure is extensively used in representing 2dimensional data in many applications like image processing, cartographic data processing. VLSI embedding, graphics, computer animation, computer-aided architecture, etc. The data structure employs the divideand-conquer technique to recursively decompose the planar region. This paper addresses the problem of planar tessellation wh...
متن کاملDynamic Data Structure for Tree-Depth Decomposition
We present a dynamic data structure for representing a graph G with tree-depth at most D. Tree-depth is an important graph parameter which arose in the study of sparse graph classes. The structure allows addition and removal of edges and vertices such that the resulting graph still has tree-depth at most D, in time bounds depending only on D. A tree-depth decomposition of the graph is maintaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japanese Society of Computational Statistics
سال: 2002
ISSN: 0915-2350,1881-1337
DOI: 10.5183/jjscs1988.15.1